Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
111	Marginals-to-Models Reducibility Michael Kearns University of Pennsylvania Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2013-11-08 17:46:03 Mathematics Computational complexity theory Graph theory Graphical models Combinatorial optimization Convex optimization Operations research Probability theory Polynomial Ellipsoid method Markov random field Bayesian network
112	Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2009-11-01 20:46:02 Mathematics Arithmetic Computational complexity theory Multiplication Algebra Finite fields Karatsuba algorithm XTR Polynomials Recurrence relation Time complexity Algorithm
113	Microsoft Word - fp16-armoni.doc Add to Reading List Source URL: www.openu.ac.il Language: English - Date: 2009-03-16 13:42:11 Computational complexity theory Cognition Neuropsychology Structural complexity theory Mathematics Reduction Problem solving Algorithm Heuristic How to Solve It Computational thinking
114	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-02-25 05:09:48 Cryptography Computational complexity theory Theory of computation Complexity classes Probabilistic complexity theory Public-key cryptography NP IP Proof of knowledge Zero-knowledge proof Random oracle FiatShamir heuristic
115	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
116	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
117	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
118	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
119	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem
120	Average Vehicle Count Technician Name: administratortoLocation: Add to Reading List Source URL: www.southbethany.org Language: English - Date: 2016-07-26 11:18:11 Analysis of algorithms Best worst and average case Computational complexity theory